منابع مشابه
ordered sets , and submodular functions
Recent developments in the use of greedy algorithms in linear programming are reviewed and extended. We find a common generalization of some theorems of Queyranne–Spieksma– Tardella, Faigle–Kern, and Fujishige about greedy algorithms for linear programs in diverse contexts. Additionally, we extend a well-known theorem of Topkis about submodular functions on the product of chains to submodular f...
متن کاملSeminar : Submodular functions and convexity
In that spirit, the topics fall into “fundamental” and “applications”. The “fundamentals” are given priority as they are, well, fundamental. Team-work across topics is indicated and encouraged. If you have suggestions for additional topics, please contact me! Regarding participation you are expected to attend regularly, give a talk (∼ 45min.), and submit a term paper (∼8 pages). The seminar wil...
متن کاملMatchings, matroids and submodular functions
This thesis focuses on three fundamental problems in combinatorial optimization: non-bipartite matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems. For the matching problem, we give an algorithm for constructing perfect or maximum cardinality mat...
متن کاملSubmodular Functions: Optimization and Approximation
Submodular functions are discrete analogue of convex functions, arising in various fields of applied mathematics including game theory, information theory, and queueing theory. This survey aims at providing an overview on fundamental properties of submodular functions and recent algorithmic developments of their optimization and approximation. For submodular function minimization, the ellipsoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 1955
ISSN: 0026-2285
DOI: 10.1307/mmj/1028990031